Every $\Sigma $-CS-module has an indecomposable decomposition
نویسندگان
چکیده
منابع مشابه
Decomposition tree and indecomposable coverings
Let G = (V,A) be a directed graph. With any subset X of V is associated the directed subgraph G[X ] = (X,A ∩ (X × X)) of G induced by X . A subset X of V is an interval of G provided that for a, b ∈ X and x ∈ V \ X , (a, x) ∈ A if and only if (b, x) ∈ A, This work was supported, in part, by an NSF EPSCoR grant EPS-0346476 and by a Nebraska Research Initiative (NRI) grant on high performance wir...
متن کاملEvery rayless graph has an unfriendly partition
We prove that every rayless graph has an unfriendly partition.
متن کاملRings for which every simple module is almost injective
We introduce the class of “right almost V-rings” which is properly between the classes of right V-rings and right good rings. A ring R is called a right almost V-ring if every simple R-module is almost injective. It is proved that R is a right almost V-ring if and only if for every R-module M, any complement of every simple submodule of M is a direct summand. Moreover, R is a right almost V-rin...
متن کاملEvery Module Is an Inverse Limit of Injectives
It is shown that any left module A over a ring R can be written as the intersection of a downward directed system of injective submodules of an injective module; equivalently, as an inverse limit of one-to-one homomorphisms of injectives. If R is left Noetherian, A can also be written as the inverse limit of a system of surjective homomorphisms of injectives. Some questions are raised. The flat...
متن کاملEvery Life Has Equal Value
The 2013 Lasker∼Bloomberg Public Service Award will be given to Bill and Melinda Gates "for leading an historic transformation in the way we view the globe's most pressing health concerns and improving the lives of millions of the world's most vulnerable."
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2000
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-00-05654-9